Some Properties of Locally Homogeneous Graphs
نویسنده
چکیده
In this paper we determine when the join of two graphs is locally homogeneous. It is shown that the Cartesian product of a locally H1 graph and a locally H2 graph is locally (H1∪ H2). All graphs H of order at most 4 for which there are no locally H graphs are determined.
منابع مشابه
An Alexandroff topology on graphs
Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...
متن کاملA remark on Remainders of homogeneous spaces in some compactifications
We prove that a remainder $Y$ of a non-locally compact rectifiable space $X$ is locally a $p$-space if and only if either $X$ is a Lindel"{o}f $p$-space or $X$ is $sigma$-compact, which improves two results by Arhangel'skii. We also show that if a non-locally compact rectifiable space $X$ that is locally paracompact has a remainder $Y$ which has locally a $G_{delta}$-diagonal, then...
متن کاملLocally Homogeneous Graphs
For a connected graph G and point v of G, let G, be the subgraph induced by the points adjacent to v . This G is called locally Go if G, = Go for all points v of G. A graph is called locally homogeneous if it is locally Go for some Go. Recent work concerning local homogeneity has focused on two broad questions. First, for which Go does there exist a G that is locally Go? This has been settled f...
متن کاملOn a Problem of Cameron's on Inexhaustible Graphs
A graph G is inexhaustible if whenever a vertex of G is deleted the remaining graph is isomorphic to G. We address a question of Cameron [6], who asked which countable graphs are inexhaustible. In particular, we prove that there are continuum many countable inexhaustible graphs with properties in common with the infinite random graph, including adjacency properties and universality. Locally fin...
متن کاملEdge Neighborhoods in Line Graphs
By an edge-neighborhood of an edge f in a graph we mean the subgraph induced by nodes outside f which are adjacent to some node on f. Connected graphs whose line graphs have the same edge-neighborhood of any edge are characterized. There are P 4 , stars, complete graphs and regular triangle-free graphs in which any two nodes with the distance two have the same number of common neighbors. Object...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010